/*
 * Copyright (C) 2011 Nicola Bonzanni
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package nl.vu.few.ibivu.jlemon.algorithms;

import nl.vu.few.ibivu.jlemon.concepts.Arc;
import nl.vu.few.ibivu.jlemon.concepts.Node;

public class AbstractGraphVisitor<N extends Node & Comparable<N>, A extends Arc & Comparable<A>> implements GraphVisitor<N, A> {

	protected AbstractGraphVisitor() {
		
	}
	
	@Override
	public void start(N node) {

	}

	@Override
	public void stop(N node) {

	}

	@Override
	public void reach(N node) {

	}

	@Override
	public void discover(A arc) {

	}

	@Override
	public void examine(A arc) {

	}

	@Override
	public void leave(N node) {

	}

	@Override
	public void backtrack(A arc) {

	}

}
